Randomized Hough Transform
نویسندگان
چکیده
Proposed in 1962, the Hough transform (HT) has been widely applied and investigated for detecting curves, shapes, and motions in the fields of image processing and computer vision. However, the HT has several shortcomings, including high computational cost, low detection accuracy, vulnerability to noise, and possibility of missing objects. Many efforts target at solving some of the problems for decades, while the key idea remains more or less the same. Proposed in 1989 and further developed thereafter, the Randomized Hough Transform (RHT) manages to considerably overcome these shortcomings via innovations on the fundamental mechanisms, with random sampling in place of pixel scanning, converging mapping in place of diverging mapping, and dynamic storage in place of accumulation array. This article will provides an overview on advances and applications of RHT in the past one and half decades.
منابع مشابه
Randomized generalized Hough transform for 2-D gray scale object detection
This paper proposes a new algorithm for 2-D object detection called Randomized Generalized Hough Transform (RGHT). It combines the Generalized Hough Transform (GHT) with the Randomized Hough Transform (RHT). Our algorithm can detect arbitrary objects of various scales and orientations in graylevel images. We also demonstrate RGHT’s advantage of high speed, low storage requirement, high accuracy...
متن کاملConnective Randomized Hough Transform (crht)
A new branch of Hough Transform algorithms, called probabilistic Hough Transforms, has been actively developed in recent years. One of the rst was a new and eecient probabilistic version of the Hough Transform for curve detection, the Randomized Hough Transform (RHT). The RHT picks n pixels from an edge image by random sampling to solve n parameters of a curve and then accumulates only one cell...
متن کاملEllipse Detection Using Randomized Hough Transform
This paper discusses the Randomized Hough Transform used to find ellipses in images. The equations to find ellipses and their implementation in the algorithm are explained. The algorithm performed well, finding ellipses of orientation 0o and 9Oo from the x-axis in various images. Ellipses were also found in a real-world image after preprocessing.
متن کاملTechnical Report - Randomized
| We describe an algorithm for the detection of ellipse shapes in images, using the Randomized Hough Transform. The algorithm is compared to a standard implementation of the Hough Transform, and the Probabilistic Hough Transform. Tests are performed using both noise-free and noisy images, and several real-world images. The algorithm was found to give improvements in accuracy, and a reduction in...
متن کاملMixed pixel classification with the randomized Hough transform
In this paper we propose the use of the Randomized Hough Transform algorithm for the determination of the proportions of pure classes present in sets of mixed pixels, for large datasets (for which the deterministic Hough is prohibitively slow) and in the presence of outliers (ie in cases that the classical Least Square Error method cannot cope). We demonstrate our results both with simulated an...
متن کاملOn a High-Speed Hough Transform Algorithm MRHT
Line detection using IIor~gh transform is one of the robust image processing methods for noisy images. Hut Hough t,ransform has a problem whose computation cost is very large in general. In order to ease this problem, many high-speed algorithms had been proposed. In this paper, we propose a new high-speed algorithm called MRHT (Multiple Randomized Hough Transform) which combines randomized edge...
متن کامل